Undergrad Complexity at CMU - Lecture 12: NP-Completeness Reductions Ryan O'Donnell 1:20:32 7 years ago 1 837 Скачать Далее
16. Complexity: P, NP, NP-completeness, Reductions MIT OpenCourseWare 1:25:25 8 years ago 398 510 Скачать Далее
Undergrad Complexity at CMU - Lecture 11: NP-Completeness and the Cook--Levin Theorem Ryan O'Donnell 1:16:03 7 years ago 2 277 Скачать Далее
Undergrad Complexity at CMU - Lecture 18: NL-Completeness and Logspace Reductions Ryan O'Donnell 1:20:21 7 years ago 2 425 Скачать Далее
Undergrad Complexity at CMU - Lecture 23: The Polynomial Hierarchy Ryan O'Donnell 1:17:40 7 years ago 4 140 Скачать Далее
Undergrad Complexity at CMU - Lecture 10: Reductions Ryan O'Donnell 1:21:41 7 years ago 2 151 Скачать Далее
Undergrad Complexity at CMU - Lecture 28: Why is P vs. NP Difficult? Ryan O'Donnell 1:20:00 7 years ago 2 225 Скачать Далее
More on constant-round interactive proof systems: Graduate Complexity Lecture 12 at CMU Ryan O'Donnell 1:21:18 6 years ago 837 Скачать Далее
Undergrad Complexity at CMU - Lecture 19: From P-Completeness to PSPACE-Completeness Ryan O'Donnell 1:19:39 7 years ago 1 902 Скачать Далее
Undergrad Complexity at CMU - Lecture 15: coNP Ryan O'Donnell 1:21:29 7 years ago 2 592 Скачать Далее
Undergrad Complexity at CMU - Lecture 17: Savitch's Theorem and NL Ryan O'Donnell 1:21:12 7 years ago 3 392 Скачать Далее
Undergrad Complexity at CMU - Lecture 26: Beyond Worst-Case Analysis Ryan O'Donnell 1:20:35 7 years ago 1 029 Скачать Далее
Undergrad Complexity at CMU - Lecture 24: Oracle Turing Machines and P^NP Ryan O'Donnell 1:22:02 7 years ago 3 666 Скачать Далее
Undergrad Complexity at CMU - Lecture 1: Course Overview Ryan O'Donnell 1:19:32 7 years ago 38 296 Скачать Далее
